Path covering number and L(2,1)-labeling number of graphs
نویسندگان
چکیده
منابع مشابه
Path covering number and L(2,1)-labeling number of graphs
A path covering of a graph G is a set of vertex disjoint paths of G containing all the vertices of G. The path covering number of G, denoted by P (G), is the minimum number of paths in a path covering of G. An k-L(2, 1)-labeling of a graph G is a mapping f from V (G) to the set {0, 1, . . . , k} such that |f(u) − f(v)| ≥ 2 if dG(u, v) = 1 and |f(u) − f(v)| ≥ 1 if dG(u, v) = 2. The L(2, 1)-label...
متن کاملCyclic Path Covering Number of Euler Graphs
In this paper, we introduce a technique to find the cyclic path covering number of Euler graphs, by using the t-hypohamiltonian graphs. Also a special type of Euler graph in the name n-gon is also being introduced and a general result of cpcn of n-gon is also found. Finally an algorithm to find the cyclic path covering number of any Euler graph is being developed. AMS subject classification: 54...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملThe α-labeling number of bipartite graphs
In this paper, we study the a-labeling number GO'. of a bipartite graph G.
متن کاملOn the path separation number of graphs
A path separator of a graph G is a set of paths P = {P1, . . . , Pt} such that for every pair of edges e, f ∈ E(G), there exist paths Pe, Pf ∈ P such that e ∈ E(Pe), f 6∈ E(Pe), e 6∈ E(Pf ) and f ∈ E(Pf ). The path separation number of G, denoted psn(G), is the smallest number of paths in a path separator. We shall estimate the path separation number of several graph families, including complet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.02.020